arXiv:1106.2436v3 [cs.LG] 25 OctFrom Bandits to Experts: On the Value of Side-Observations Ohad Shamir Microsoft Research New England

Source URL: arxiv.org

• Graph theory
• NP-complete problems
• Independent set
• Matching
• Clique
• Ear decomposition
• Graph coloring
• Trapezoid graph

On Coloring Resilient Graphs Jeremy Kun, Lev Reyzin University of Illinois at Chicago Department of Mathematics, Statistics, and Computer Science MFCS14, August 28, 2014

Source URL: www.levreyzin.com

• Graph coloring
• Colorable
• Uniquely colorable graph
• Interval edge coloring

Anti-Coordination Games and Stable Graph Colorings Jeremy Kun, Brian Powers, and Lev Reyzin Department of Mathematics, Statistics, and Computer Science University of Illinois at Chicago {jkun2,bpower6,lreyzin}@math.uic.e

Source URL: www.levreyzin.com

• Graph theory
• Graph coloring
• Mathematics
• Gadget
• Graph
• Edge coloring
• Monochromatic triangle

Revisiting Graph Coloring Register Allocation: A Study of the Chaitin-Briggs and Callahan-Koblenz Algorithms Keith Cooper, Anshuman Dasgupta, Jason Eckhardt Department of Computer Science, Rice University. {keith, anshum

Source URL: www.ece.lsu.edu

LNCSOn Coloring Resilient Graphs

Source URL: www.levreyzin.com

• Graph theory
• Graph coloring
• Gadget
• Planar graph
• Uniquely colorable graph
• Interval edge coloring

Lev Reyzin Clique Talk, 2007  

Source URL: www.levreyzin.com

• Mathematics
• Graph coloring
• NP-complete problems
• Hypergraph
• Discrete mathematics
• Theoretical computer science

Recovering Social Networks by Observing Votes Benjamin Fish and Yi Huang and Lev Reyzin Department of Mathematics, Statistics, & Computer Science University of Illinois at Chicago, Chicago, IL 60607 {bfish3,yihuang89,lre

Source URL: www.levreyzin.com

• Graph theory
• Bipartite graph
• Parity
• Graph
• Ear decomposition
• Matching
• NP-complete problems
• Graph coloring
• Line graph

b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs ∗ Flavia Bonomo1 , Oliver Schaudt2 , Maya Stein3 , and Mario Valencia-Pabon†4 1

Source URL: www.zaik.uni-koeln.de

• Graph theory
• Graph coloring
• Matching
• NP-complete problems
• Combinatorial optimization
• Graph operations
• Blossom algorithm
• Bipartite graph
• Chordal graph
• Complete coloring
• Cograph
• Ear decomposition

Cubical coloring — fractional covering by cuts Robert Sˇa´mal Abstract We introduce a new graph invariant that measures fractional covering of a graph by cuts. Besides being interesting in its own, it is useful for s

Source URL: iti.mff.cuni.cz

Formal Verification of Coalescing Graph-Coloring Register Allocation Sandrine Blazy1 , Benoˆıt Robillard2 , and Andrew W. Appel3 1 IRISA - Universit´e Rennes 1

Source URL: www.irisa.fr